TSTP Solution File: NUM754^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM754^1 : TPTP v8.1.2. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n028.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 08:15:09 EDT 2024
% Result : Theorem 0.11s 0.28s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 15
% Syntax : Number of formulae : 52 ( 21 unt; 9 typ; 0 def)
% Number of atoms : 234 ( 70 equ; 0 cnn)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 375 ( 50 ~; 36 |; 0 &; 274 @)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 76 ( 0 ^ 76 !; 0 ?; 76 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
frac: $tType ).
thf(func_def_0,type,
frac: $tType ).
thf(func_def_1,type,
x: frac ).
thf(func_def_2,type,
y: frac ).
thf(func_def_3,type,
z: frac ).
thf(func_def_4,type,
u: frac ).
thf(func_def_5,type,
eq: frac > frac > $o ).
thf(func_def_7,type,
moref: frac > frac > $o ).
thf(func_def_8,type,
pf: frac > frac > frac ).
thf(f59,plain,
$false,
inference(subsumption_resolution,[],[f58,f32]) ).
thf(f32,plain,
( ( moref @ z @ u )
= $true ),
inference(cnf_transformation,[],[f12]) ).
thf(f12,plain,
( ( moref @ z @ u )
= $true ),
inference(fool_elimination,[],[f11]) ).
thf(f11,plain,
moref @ z @ u,
inference(rectify,[],[f2]) ).
thf(f2,axiom,
moref @ z @ u,
file('/export/starexec/sandbox/tmp/tmp.9cIgLUV2Lc/Vampire---4.8_25494',m) ).
thf(f58,plain,
( ( moref @ z @ u )
!= $true ),
inference(subsumption_resolution,[],[f57,f31]) ).
thf(f31,plain,
( ( eq @ x @ y )
= $true ),
inference(cnf_transformation,[],[f16]) ).
thf(f16,plain,
( ( eq @ x @ y )
= $true ),
inference(fool_elimination,[],[f15]) ).
thf(f15,plain,
eq @ x @ y,
inference(rectify,[],[f1]) ).
thf(f1,axiom,
eq @ x @ y,
file('/export/starexec/sandbox/tmp/tmp.9cIgLUV2Lc/Vampire---4.8_25494',e) ).
thf(f57,plain,
( ( ( eq @ x @ y )
!= $true )
| ( ( moref @ z @ u )
!= $true ) ),
inference(trivial_inequality_removal,[],[f56]) ).
thf(f56,plain,
( ( $true != $true )
| ( ( eq @ x @ y )
!= $true )
| ( ( moref @ z @ u )
!= $true ) ),
inference(superposition,[],[f55,f33]) ).
thf(f33,plain,
! [X0: frac,X1: frac] :
( ( eq @ ( pf @ X0 @ X1 ) @ ( pf @ X1 @ X0 ) )
= $true ),
inference(cnf_transformation,[],[f28]) ).
thf(f28,plain,
! [X0: frac,X1: frac] :
( ( eq @ ( pf @ X0 @ X1 ) @ ( pf @ X1 @ X0 ) )
= $true ),
inference(rectify,[],[f20]) ).
thf(f20,plain,
! [X1: frac,X0: frac] :
( ( eq @ ( pf @ X1 @ X0 ) @ ( pf @ X0 @ X1 ) )
= $true ),
inference(fool_elimination,[],[f19]) ).
thf(f19,plain,
! [X0: frac,X1: frac] : ( eq @ ( pf @ X1 @ X0 ) @ ( pf @ X0 @ X1 ) ),
inference(rectify,[],[f5]) ).
thf(f5,axiom,
! [X1: frac,X0: frac] : ( eq @ ( pf @ X0 @ X1 ) @ ( pf @ X1 @ X0 ) ),
file('/export/starexec/sandbox/tmp/tmp.9cIgLUV2Lc/Vampire---4.8_25494',satz58) ).
thf(f55,plain,
! [X0: frac,X1: frac] :
( ( $true
!= ( eq @ ( pf @ X0 @ X1 ) @ ( pf @ u @ y ) ) )
| ( ( eq @ x @ X0 )
!= $true )
| ( ( moref @ z @ X1 )
!= $true ) ),
inference(trivial_inequality_removal,[],[f52]) ).
thf(f52,plain,
! [X0: frac,X1: frac] :
( ( $true != $true )
| ( ( moref @ z @ X1 )
!= $true )
| ( $true
!= ( eq @ ( pf @ X0 @ X1 ) @ ( pf @ u @ y ) ) )
| ( ( eq @ x @ X0 )
!= $true ) ),
inference(superposition,[],[f51,f29]) ).
thf(f29,plain,
! [X2: frac,X3: frac,X0: frac,X1: frac] :
( ( $true
= ( moref @ ( pf @ X3 @ X1 ) @ ( pf @ X0 @ X2 ) ) )
| ( $true
!= ( moref @ X1 @ X2 ) )
| ( $true
!= ( eq @ X3 @ X0 ) ) ),
inference(cnf_transformation,[],[f26]) ).
thf(f26,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( ( $true
= ( moref @ ( pf @ X3 @ X1 ) @ ( pf @ X0 @ X2 ) ) )
| ( $true
!= ( eq @ X3 @ X0 ) )
| ( $true
!= ( moref @ X1 @ X2 ) ) ),
inference(rectify,[],[f23]) ).
thf(f23,plain,
! [X2: frac,X1: frac,X0: frac,X3: frac] :
( ( $true
= ( moref @ ( pf @ X3 @ X1 ) @ ( pf @ X2 @ X0 ) ) )
| ( $true
!= ( eq @ X3 @ X2 ) )
| ( ( moref @ X1 @ X0 )
!= $true ) ),
inference(flattening,[],[f22]) ).
thf(f22,plain,
! [X1: frac,X3: frac,X0: frac,X2: frac] :
( ( $true
= ( moref @ ( pf @ X3 @ X1 ) @ ( pf @ X2 @ X0 ) ) )
| ( ( moref @ X1 @ X0 )
!= $true )
| ( $true
!= ( eq @ X3 @ X2 ) ) ),
inference(ennf_transformation,[],[f14]) ).
thf(f14,plain,
! [X1: frac,X3: frac,X0: frac,X2: frac] :
( ( $true
= ( eq @ X3 @ X2 ) )
=> ( ( ( moref @ X1 @ X0 )
= $true )
=> ( $true
= ( moref @ ( pf @ X3 @ X1 ) @ ( pf @ X2 @ X0 ) ) ) ) ),
inference(fool_elimination,[],[f13]) ).
thf(f13,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( ( eq @ X3 @ X2 )
=> ( ( moref @ X1 @ X0 )
=> ( moref @ ( pf @ X3 @ X1 ) @ ( pf @ X2 @ X0 ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f4,axiom,
! [X3: frac,X2: frac,X1: frac,X0: frac] :
( ( eq @ X0 @ X1 )
=> ( ( moref @ X2 @ X3 )
=> ( moref @ ( pf @ X0 @ X2 ) @ ( pf @ X1 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.9cIgLUV2Lc/Vampire---4.8_25494',satz62g) ).
thf(f51,plain,
! [X0: frac] :
( ( ( moref @ ( pf @ x @ z ) @ X0 )
!= $true )
| ( ( eq @ X0 @ ( pf @ u @ y ) )
!= $true ) ),
inference(trivial_inequality_removal,[],[f50]) ).
thf(f50,plain,
! [X0: frac] :
( ( ( eq @ X0 @ ( pf @ u @ y ) )
!= $true )
| ( ( moref @ ( pf @ x @ z ) @ X0 )
!= $true )
| ( $true != $true ) ),
inference(superposition,[],[f37,f33]) ).
thf(f37,plain,
! [X0: frac,X1: frac] :
( ( $true
!= ( eq @ X0 @ ( pf @ z @ x ) ) )
| ( ( eq @ X1 @ ( pf @ u @ y ) )
!= $true )
| ( ( moref @ X0 @ X1 )
!= $true ) ),
inference(trivial_inequality_removal,[],[f36]) ).
thf(f36,plain,
! [X0: frac,X1: frac] :
( ( $true
!= ( eq @ X0 @ ( pf @ z @ x ) ) )
| ( ( eq @ X1 @ ( pf @ u @ y ) )
!= $true )
| ( $true != $true )
| ( ( moref @ X0 @ X1 )
!= $true ) ),
inference(superposition,[],[f34,f30]) ).
thf(f30,plain,
! [X2: frac,X3: frac,X0: frac,X1: frac] :
( ( ( moref @ X1 @ X0 )
= $true )
| ( ( moref @ X2 @ X3 )
!= $true )
| ( ( eq @ X2 @ X1 )
!= $true )
| ( $true
!= ( eq @ X3 @ X0 ) ) ),
inference(cnf_transformation,[],[f27]) ).
thf(f27,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( ( ( eq @ X2 @ X1 )
!= $true )
| ( ( moref @ X2 @ X3 )
!= $true )
| ( $true
!= ( eq @ X3 @ X0 ) )
| ( ( moref @ X1 @ X0 )
= $true ) ),
inference(rectify,[],[f25]) ).
thf(f25,plain,
! [X2: frac,X0: frac,X1: frac,X3: frac] :
( ( ( eq @ X1 @ X0 )
!= $true )
| ( ( moref @ X1 @ X3 )
!= $true )
| ( $true
!= ( eq @ X3 @ X2 ) )
| ( $true
= ( moref @ X0 @ X2 ) ) ),
inference(flattening,[],[f24]) ).
thf(f24,plain,
! [X2: frac,X1: frac,X3: frac,X0: frac] :
( ( $true
= ( moref @ X0 @ X2 ) )
| ( $true
!= ( eq @ X3 @ X2 ) )
| ( ( eq @ X1 @ X0 )
!= $true )
| ( ( moref @ X1 @ X3 )
!= $true ) ),
inference(ennf_transformation,[],[f18]) ).
thf(f18,plain,
! [X2: frac,X1: frac,X3: frac,X0: frac] :
( ( ( moref @ X1 @ X3 )
= $true )
=> ( ( ( eq @ X1 @ X0 )
= $true )
=> ( ( $true
= ( eq @ X3 @ X2 ) )
=> ( $true
= ( moref @ X0 @ X2 ) ) ) ) ),
inference(fool_elimination,[],[f17]) ).
thf(f17,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( ( moref @ X1 @ X3 )
=> ( ( eq @ X1 @ X0 )
=> ( ( eq @ X3 @ X2 )
=> ( moref @ X0 @ X2 ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f3,axiom,
! [X2: frac,X0: frac,X3: frac,X1: frac] :
( ( moref @ X0 @ X1 )
=> ( ( eq @ X0 @ X2 )
=> ( ( eq @ X1 @ X3 )
=> ( moref @ X2 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.9cIgLUV2Lc/Vampire---4.8_25494',satz44) ).
thf(f34,plain,
( ( moref @ ( pf @ z @ x ) @ ( pf @ u @ y ) )
!= $true ),
inference(cnf_transformation,[],[f21]) ).
thf(f21,plain,
( ( moref @ ( pf @ z @ x ) @ ( pf @ u @ y ) )
!= $true ),
inference(flattening,[],[f10]) ).
thf(f10,plain,
( ( moref @ ( pf @ z @ x ) @ ( pf @ u @ y ) )
!= $true ),
inference(fool_elimination,[],[f9]) ).
thf(f9,plain,
~ ( moref @ ( pf @ z @ x ) @ ( pf @ u @ y ) ),
inference(rectify,[],[f7]) ).
thf(f7,negated_conjecture,
~ ( moref @ ( pf @ z @ x ) @ ( pf @ u @ y ) ),
inference(negated_conjecture,[],[f6]) ).
thf(f6,conjecture,
moref @ ( pf @ z @ x ) @ ( pf @ u @ y ),
file('/export/starexec/sandbox/tmp/tmp.9cIgLUV2Lc/Vampire---4.8_25494',satz62h) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : NUM754^1 : TPTP v8.1.2. Released v3.7.0.
% 0.00/0.08 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.08/0.27 % Computer : n028.cluster.edu
% 0.08/0.27 % Model : x86_64 x86_64
% 0.08/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.27 % Memory : 8042.1875MB
% 0.08/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.27 % CPULimit : 300
% 0.08/0.27 % WCLimit : 300
% 0.08/0.27 % DateTime : Fri May 3 14:42:52 EDT 2024
% 0.08/0.27 % CPUTime :
% 0.08/0.27 This is a TH0_THM_NEQ_NAR problem
% 0.08/0.27 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.9cIgLUV2Lc/Vampire---4.8_25494
% 0.08/0.28 % (25710)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (3000ds/4Mi)
% 0.08/0.28 % (25712)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.08/0.28 % (25714)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (3000ds/275Mi)
% 0.08/0.28 % (25716)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (3000ds/3Mi)
% 0.08/0.28 % (25709)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (3000ds/183Mi)
% 0.08/0.28 % (25711)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (3000ds/27Mi)
% 0.08/0.28 % (25713)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.08/0.28 % (25715)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (3000ds/18Mi)
% 0.08/0.28 % (25712)Instruction limit reached!
% 0.08/0.28 % (25712)------------------------------
% 0.08/0.28 % (25712)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.08/0.28 % (25712)Termination reason: Unknown
% 0.08/0.28 % (25713)Instruction limit reached!
% 0.08/0.28 % (25713)------------------------------
% 0.08/0.28 % (25713)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.08/0.28 % (25713)Termination reason: Unknown
% 0.08/0.28 % (25713)Termination phase: Saturation
% 0.08/0.28
% 0.08/0.28 % (25713)Memory used [KB]: 895
% 0.08/0.28 % (25713)Time elapsed: 0.002 s
% 0.08/0.28 % (25713)Instructions burned: 2 (million)
% 0.08/0.28 % (25713)------------------------------
% 0.08/0.28 % (25713)------------------------------
% 0.08/0.28 % (25712)Termination phase: Saturation
% 0.08/0.28
% 0.08/0.28 % (25712)Memory used [KB]: 5373
% 0.08/0.28 % (25712)Time elapsed: 0.002 s
% 0.08/0.28 % (25712)Instructions burned: 2 (million)
% 0.08/0.28 % (25712)------------------------------
% 0.08/0.28 % (25712)------------------------------
% 0.08/0.28 % (25716)Instruction limit reached!
% 0.08/0.28 % (25716)------------------------------
% 0.08/0.28 % (25716)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.08/0.28 % (25716)Termination reason: Unknown
% 0.08/0.28 % (25716)Termination phase: Saturation
% 0.08/0.28
% 0.08/0.28 % (25716)Memory used [KB]: 5500
% 0.08/0.28 % (25716)Time elapsed: 0.003 s
% 0.08/0.28 % (25716)Instructions burned: 3 (million)
% 0.08/0.28 % (25716)------------------------------
% 0.08/0.28 % (25716)------------------------------
% 0.08/0.28 % (25710)Instruction limit reached!
% 0.08/0.28 % (25710)------------------------------
% 0.08/0.28 % (25710)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.08/0.28 % (25710)Termination reason: Unknown
% 0.08/0.28 % (25710)Termination phase: Saturation
% 0.08/0.28
% 0.08/0.28 % (25710)Memory used [KB]: 5500
% 0.08/0.28 % (25710)Time elapsed: 0.003 s
% 0.08/0.28 % (25710)Instructions burned: 4 (million)
% 0.08/0.28 % (25710)------------------------------
% 0.08/0.28 % (25710)------------------------------
% 0.08/0.28 % (25714)First to succeed.
% 0.11/0.28 % (25709)Also succeeded, but the first one will report.
% 0.11/0.28 % (25714)Refutation found. Thanks to Tanya!
% 0.11/0.28 % SZS status Theorem for Vampire---4
% 0.11/0.28 % SZS output start Proof for Vampire---4
% See solution above
% 0.11/0.28 % (25714)------------------------------
% 0.11/0.28 % (25714)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.28 % (25714)Termination reason: Refutation
% 0.11/0.28
% 0.11/0.28 % (25714)Memory used [KB]: 5500
% 0.11/0.28 % (25714)Time elapsed: 0.004 s
% 0.11/0.28 % (25714)Instructions burned: 4 (million)
% 0.11/0.28 % (25714)------------------------------
% 0.11/0.28 % (25714)------------------------------
% 0.11/0.28 % (25708)Success in time 0.005 s
% 0.11/0.29 % Vampire---4.8 exiting
%------------------------------------------------------------------------------